Labelled Maximal Tubings on Paths and Graph Associahedra
نویسندگان
چکیده
منابع مشابه
Graph Properties of Graph Associahedra
A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their diameter and their Hamiltonicity. Our results extend known results for the classical associahedra (path associahedra) and permutahedra (complete graph associa...
متن کاملOf Graph - Associahedra
Given any finite graph G, we offer a simple realization of the graph-associahedron PG using integer coordinates.
متن کاملCoxeter Complexes and Graph-associahedra
Given a graph Γ, we construct a simple, convex polytope, dubbed graphassociahedra, whose face poset is based on the connected subgraphs of Γ. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that for any simplicial Coxeter system, the minimal blow-ups of its associated Coxeter complex has a tiling by graph-associahedra. The ...
متن کاملA realization of graph associahedra
Given any finite graph G, we offer a simple realization of the graph-associahedron PG using integer coordinates.
متن کاملBergman Complexes, Coxeter Arrangements, and Graph Associahedra
Tropical varieties play an important role in algebraic geometry. The Bergman complex B(M) and the positive Bergman complex B+(M) of an oriented matroid M generalize to matroids the notions of the tropical variety and positive tropical variety associated to a linear ideal. Our main result is that if A is a Coxeter arrangement of type Φ with corresponding oriented matroid MΦ, then B (MΦ) is dual ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2019
ISSN: 1307-5543
DOI: 10.29020/nybg.ejpam.v12i3.3448